- lexicographic relation
- лексикографическое отношение
English-Russian Dictionary on Probability, Statistics, and Combinatorics. — Philadelphia and Moscow. Society for Industrial and Applied Mathematics and TVP Science Publishers. K. A. Borovkov. 1994.
lexicographic relation
Смотреть что такое "lexicographic relation" в других словарях:
Lexicographic preferences — (lexicographical order based on the order of amount of each good) describe comparative preferences where an economic agent infinitely prefers one good (X) to another (Y). Thus if offered several bundles of goods, the agent will choose the bundle… … Wikipedia
Lexicographic information cost — is a new concept within the field of lexicography. The term refers to the difficulties and inconveniences that the user of a dictionary believes or feels are associated with consulting a particular dictionary or dictionary article. For example,… … Wikipedia
Lexicographic product of graphs — In graph theory, the lexicographic product or graph composition G ∙ H of graphs G and H is a graph such that * the vertex set of G ∙ H is the cartesian product V(G) imes V(H) ; and * any two vertices (u,u ) and (v,v ) are adjacent in G ∙ H if and … Wikipedia
Well-founded relation — In mathematics, a binary relation, R, is well founded (or wellfounded) on a class X if and only if every non empty subset of X has a minimal element with respect to R; that is, for every non empty subset S of X, there is an element m of S such… … Wikipedia
Cyclic order — In mathematics, a cyclic order is a way to arrange a set of objects in a circle.[nb] Unlike most structures in order theory, a cyclic order cannot be modeled as a binary relation a < b . One does not say that east is more clockwise than west.… … Wikipedia
Radix sort — In computer science, radix sort is a sorting algorithm that sorts integers by processing individual digits. Because integers can represent strings of characters (e.g., names or dates) and specially formatted floating point numbers, radix sort is… … Wikipedia
Strict weak ordering — The 13 possible strict weak orderings on a set of three elements {a, b, c}. The only partially ordered sets are coloured, while totally ordered ones are in black. Two orderings are shown as connected by an edge if they differ by a single… … Wikipedia
Morphology (linguistics) — For other uses, see Morphology. Linguistics … Wikipedia
Nomenclature — For conventions governing Wikipedia article names, see Wikipedia:Naming conventions, for soviet class, see Nomenklatura. Nomenclature is a term that applies to either a list of names and/or terms, or to the system of principles, procedures and… … Wikipedia
Edge coloring — A 3 edge coloring of the Desargues graph. In graph theory, an edge coloring of a graph is an assignment of “colors” to the edges of the graph so that no two adjacent edges have the same color. For example, the figure to the right shows an edge… … Wikipedia
Cooperative game — This article is about a part of game theory. For video gaming, see Cooperative gameplay. For the similar feature in some board games, see cooperative board game In game theory, a cooperative game is a game where groups of players ( coalitions )… … Wikipedia
